منابع مشابه
Width-parameterized SAT: Time-Space Tradeoffs
Alekhnovich and Razborov (2002) presented an algorithm that solves SAT on instances φ of size n and tree-width TW(φ), using time and space bounded by 2O(TW(φ))nO(1). Although several follow-up works appeared over the last decade, the first open question of Alekhnovich and Razborov remained essentially unresolved: Can one check satisfiability of formulas with small tree-width in polynomial space...
متن کاملSolution Counting for CSP and SAT with Large Tree-Width
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress has been made using search methods, such as Backtracking with Tree-Decomposition (BTD) [Jégou and Terrioux, 2003], which exploit the constraint graph structure in order to solve CSPs. We propose to adapt BTD for solving the #CSP problem. The resulting exact counting method h...
متن کاملSAT-Problems - New Findings
Abstract : SAT-problems in general and 3-SAT problems in particular are very important and interesting NP-complete problems with many applications in different areas. In several previous papers, before all in [2] and in [5], we showed the use of ternary vectors and set-theoretic considerations as well as binary codings and bit-parallel vector operations in order to solve this problem. The appro...
متن کاملSAT-to-SAT: Declarative Extension of SAT Solvers with New Propagators
Special-purpose propagators speed up solving logic programs by inferring facts that are hard to deduce otherwise. However, implementing special-purpose propagators is a non-trivial task and requires expert knowledge of solvers. This paper proposes a novel approach in logic programming that allows (1) logical specification of both the problem itself and its propagators and (2) automatic incorpor...
متن کاملIncremental SAT Solving for SAT Based Planning
One of the most successful approaches to automated planning is the translation to propositional satis ability (SAT). This thesis evaluates incremental SAT solving for several modern encodings for SAT based planning. Experiments based on benchmarks from the 2014 International Planning Competition show that an incremental approach signi cantly outperforms non-incremental solving. Although, planni...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2021
ISSN: 0004-3702
DOI: 10.1016/j.artint.2021.103460